0.00/0.08 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.11/0.33 % Computer : n003.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 1200 0.11/0.33 % WCLimit : 120 0.11/0.33 % DateTime : Tue Jul 13 16:02:24 EDT 2021 0.11/0.33 % CPUTime : 0.11/0.33 % Number of cores: 8 0.11/0.33 % Python version: Python 3.6.8 0.11/0.33 # Version: 2.6rc1-ho 0.11/0.35 # No SInE strategy applied 0.11/0.35 # Trying AutoSched0 for 59 seconds 0.17/0.49 # AutoSched0-Mode selected heuristic C07_19_nc_SOS_SAT001_MinMin_rr 0.17/0.49 # and selection function SelectMaxLComplexAvoidPosPred. 0.17/0.49 # 0.17/0.49 # Preprocessing time : 0.075 s 0.17/0.49 # Presaturation interreduction done 0.17/0.49 0.17/0.49 # Proof found! 0.17/0.49 # SZS status Theorem 0.17/0.49 # SZS output start CNFRefutation 0.17/0.49 thf(conj_0, conjecture, ?[X430:int, X271:int]:(plus_plus_int @ (power_power_int @ X430 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X271 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.17/0.49 thf(fact_142_number__of__is__id, axiom, ![X8:int]:(number_number_of_int @ X8)=(X8), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_142_number__of__is__id)). 0.17/0.49 thf(fact_264_semiring__norm_I110_J, axiom, (one_one_int)=(number_number_of_int @ (bit1 @ pls)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_264_semiring__norm_I110_J)). 0.17/0.49 thf(fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J, axiom, ![X63:int]:(times_times_int @ one_one_int @ X63)=(X63), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J)). 0.17/0.49 thf(fact_200_mult__Bit0, axiom, ![X8:int, X27:int]:(times_times_int @ (bit0 @ X8) @ X27)=(bit0 @ (times_times_int @ X8 @ X27)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_200_mult__Bit0)). 0.17/0.49 thf(fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J, axiom, ![X281:int, X282:int]:(plus_plus_int @ X281 @ X282)=(plus_plus_int @ X282 @ X281), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J)). 0.17/0.49 thf(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06, axiom, (?[X430:int, X271:int]:(plus_plus_int @ (power_power_int @ X430 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X271 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)<=(t)=(one_one_int)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)). 0.17/0.49 thf(fact_249_add__Bit1__Bit0, axiom, ![X8:int, X27:int]:(plus_plus_int @ (bit1 @ X8) @ (bit0 @ X27))=(bit1 @ (plus_plus_int @ X8 @ X27)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_249_add__Bit1__Bit0)). 0.17/0.49 thf(fact_202_add__Pls, axiom, ![X8:int]:(plus_plus_int @ pls @ X8)=(X8), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_202_add__Pls)). 0.17/0.49 thf(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06, axiom, (?[X430:int, X271:int]:(plus_plus_int @ (power_power_int @ X430 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X271 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)<=ord_less_int @ one_one_int @ t), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)). 0.17/0.49 thf(fact_565_order__le__neq__implies__less, axiom, ![X182:int, X183:int]:(((X182)!=(X183)=>ord_less_int @ X182 @ X183)<=ord_less_eq_int @ X182 @ X183), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_565_order__le__neq__implies__less)). 0.17/0.49 thf(fact_0_tpos, axiom, ord_less_eq_int @ one_one_int @ t, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_tpos)). 0.17/0.49 thf(c_0_12, negated_conjecture, ~(?[X430:int, X271:int]:(plus_plus_int @ (power_power_int @ X430 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X271 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)), inference(assume_negation,[status(cth)],[conj_0])). 0.17/0.49 thf(c_0_13, plain, ![X3145:int]:(number_number_of_int @ X3145)=(X3145), inference(variable_rename,[status(thm)],[fact_142_number__of__is__id])). 0.17/0.49 thf(c_0_14, negated_conjecture, ![X3336:int, X3337:int]:(plus_plus_int @ (power_power_int @ X3336 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X3337 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])). 0.17/0.49 thf(c_0_15, plain, (one_one_int)=(number_number_of_int @ (bit1 @ pls)), inference(split_conjunct,[status(thm)],[fact_264_semiring__norm_I110_J])). 0.17/0.49 thf(c_0_16, plain, ![X1:int]:(number_number_of_int @ X1)=(X1), inference(split_conjunct,[status(thm)],[c_0_13])). 0.17/0.49 thf(c_0_17, plain, ![X2250:int]:(times_times_int @ one_one_int @ X2250)=(X2250), inference(variable_rename,[status(thm)],[fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J])). 0.17/0.49 thf(c_0_18, negated_conjecture, ![X1:int, X2:int]:(plus_plus_int @ (power_power_int @ X1 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X2 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int), inference(split_conjunct,[status(thm)],[c_0_14])). 0.17/0.49 thf(c_0_19, plain, (one_one_int)=(bit1 @ pls), inference(rw,[status(thm)],[c_0_15, c_0_16])). 0.17/0.49 thf(c_0_20, plain, ![X3368:int, X3369:int]:(times_times_int @ (bit0 @ X3368) @ X3369)=(bit0 @ (times_times_int @ X3368 @ X3369)), inference(variable_rename,[status(thm)],[fact_200_mult__Bit0])). 0.17/0.49 thf(c_0_21, plain, ![X1:int]:(times_times_int @ one_one_int @ X1)=(X1), inference(split_conjunct,[status(thm)],[c_0_17])). 0.17/0.49 thf(c_0_22, negated_conjecture, ![X1:int, X2:int]:(plus_plus_int @ (power_power_int @ X1 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X2 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (bit0 @ (bit0 @ (bit1 @ pls))) @ m) @ (bit1 @ pls)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_16]), c_0_19])). 0.17/0.49 thf(c_0_23, plain, ![X1:int, X2:int]:(times_times_int @ (bit0 @ X1) @ X2)=(bit0 @ (times_times_int @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_20])). 0.17/0.49 thf(c_0_24, plain, ![X1:int]:(times_times_int @ (bit1 @ pls) @ X1)=(X1), inference(rw,[status(thm)],[c_0_21, c_0_19])). 0.17/0.49 thf(c_0_25, plain, ![X2561:int, X2562:int]:(plus_plus_int @ X2561 @ X2562)=(plus_plus_int @ X2562 @ X2561), inference(variable_rename,[status(thm)],[fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J])). 0.17/0.49 thf(c_0_26, plain, ((t)=(one_one_int)=>?[X430:int, X271:int]:(plus_plus_int @ (power_power_int @ X430 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X271 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)), inference(fof_simplification,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])). 0.17/0.49 thf(c_0_27, negated_conjecture, ![X1:int, X2:int]:(plus_plus_int @ (power_power_int @ X1 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X2 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (bit0 @ (bit0 @ m)) @ (bit1 @ pls)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23]), c_0_23]), c_0_24])). 0.17/0.49 thf(c_0_28, plain, ![X2:int, X1:int]:(plus_plus_int @ X1 @ X2)=(plus_plus_int @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_25])). 0.17/0.49 thf(c_0_29, plain, ![X3011:int, X3012:int]:(plus_plus_int @ (bit1 @ X3011) @ (bit0 @ X3012))=(bit1 @ (plus_plus_int @ X3011 @ X3012)), inference(variable_rename,[status(thm)],[fact_249_add__Bit1__Bit0])). 0.17/0.49 thf(c_0_30, plain, ![X2808:int]:(plus_plus_int @ pls @ X2808)=(X2808), inference(variable_rename,[status(thm)],[fact_202_add__Pls])). 0.17/0.49 thf(c_0_31, plain, (ord_less_int @ one_one_int @ t=>?[X430:int, X271:int]:(plus_plus_int @ (power_power_int @ X430 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X271 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)), inference(fof_simplification,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])). 0.17/0.49 thf(c_0_32, plain, ![X182:int, X183:int]:(ord_less_eq_int @ X182 @ X183=>((X182)!=(X183)=>ord_less_int @ X182 @ X183)), inference(fof_simplification,[status(thm)],[fact_565_order__le__neq__implies__less])). 0.17/0.49 thf(c_0_33, plain, ((t)!=(one_one_int)|(plus_plus_int @ (power_power_int @ esk6_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk7_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])). 0.17/0.49 thf(c_0_34, negated_conjecture, ![X1:int, X2:int]:(plus_plus_int @ (power_power_int @ X1 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X2 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (bit1 @ pls) @ (bit0 @ (bit0 @ m))), inference(rw,[status(thm)],[c_0_27, c_0_28])). 0.17/0.49 thf(c_0_35, plain, ![X1:int, X2:int]:(plus_plus_int @ (bit1 @ X1) @ (bit0 @ X2))=(bit1 @ (plus_plus_int @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_29])). 0.17/0.49 thf(c_0_36, plain, ![X1:int]:(plus_plus_int @ pls @ X1)=(X1), inference(split_conjunct,[status(thm)],[c_0_30])). 0.17/0.49 thf(c_0_37, plain, (~ord_less_int @ one_one_int @ t|(plus_plus_int @ (power_power_int @ esk3_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk4_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])). 0.17/0.49 thf(c_0_38, plain, ![X2414:int, X2415:int]:(~ord_less_eq_int @ X2414 @ X2415|((X2414)=(X2415)|ord_less_int @ X2414 @ X2415)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])). 0.17/0.49 thf(c_0_39, plain, ord_less_eq_int @ one_one_int @ t, inference(split_conjunct,[status(thm)],[fact_0_tpos])). 0.17/0.49 thf(c_0_40, plain, ((plus_plus_int @ (power_power_int @ esk6_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk7_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)|(t)!=(one_one_int)), inference(split_conjunct,[status(thm)],[c_0_33])). 0.17/0.49 thf(c_0_41, negated_conjecture, ![X1:int, X2:int]:(plus_plus_int @ (power_power_int @ X1 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X2 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(bit1 @ (bit0 @ m)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35]), c_0_36])). 0.17/0.49 thf(c_0_42, plain, ((plus_plus_int @ (power_power_int @ esk3_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk4_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)|~ord_less_int @ one_one_int @ t), inference(split_conjunct,[status(thm)],[c_0_37])). 0.17/0.49 thf(c_0_43, plain, ![X1:int, X2:int]:((X1)=(X2)|ord_less_int @ X1 @ X2|~ord_less_eq_int @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_38])). 0.17/0.49 thf(c_0_44, plain, ord_less_eq_int @ (bit1 @ pls) @ t, inference(rw,[status(thm)],[c_0_39, c_0_19])). 0.17/0.49 thf(c_0_45, plain, (t)!=(bit1 @ pls), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_16]), c_0_23]), c_0_23]), c_0_24]), c_0_19]), c_0_28]), c_0_35]), c_0_36]), c_0_19]), c_0_41])). 0.17/0.49 thf(c_0_46, plain, ~ord_less_int @ (bit1 @ pls) @ t, inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42, c_0_16]), c_0_23]), c_0_23]), c_0_24]), c_0_19]), c_0_28]), c_0_35]), c_0_36]), c_0_19]), c_0_41])). 0.17/0.49 thf(c_0_47, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45]), c_0_46]), ['proof']). 0.17/0.49 # SZS output end CNFRefutation 0.17/0.49 # Proof object total steps : 48 0.17/0.49 # Proof object clause steps : 22 0.17/0.49 # Proof object formula steps : 26 0.17/0.49 # Proof object conjectures : 8 0.17/0.49 # Proof object clause conjectures : 5 0.17/0.49 # Proof object formula conjectures : 3 0.17/0.49 # Proof object initial clauses used : 12 0.17/0.49 # Proof object initial formulas used : 12 0.17/0.49 # Proof object generating inferences : 1 0.17/0.49 # Proof object simplifying inferences : 33 0.17/0.49 # Training examples: 0 positive, 0 negative 0.17/0.49 # Parsed axioms : 748 0.17/0.49 # Removed by relevancy pruning/SinE : 0 0.17/0.49 # Initial clauses : 984 0.17/0.49 # Removed in clause preprocessing : 71 0.17/0.49 # Initial clauses in saturation : 913 0.17/0.49 # Processed clauses : 1185 0.17/0.49 # ...of these trivial : 144 0.17/0.49 # ...subsumed : 174 0.17/0.49 # ...remaining for further processing : 867 0.17/0.49 # Other redundant clauses eliminated : 95 0.17/0.49 # Clauses deleted for lack of memory : 0 0.17/0.49 # Backward-subsumed : 5 0.17/0.49 # Backward-rewritten : 62 0.17/0.49 # Generated clauses : 314 0.17/0.49 # ...of the previous two non-trivial : 245 0.17/0.49 # Contextual simplify-reflections : 1 0.17/0.49 # Paramodulations : 234 0.17/0.49 # Factorizations : 0 0.17/0.49 # NegExts : 0 0.17/0.49 # Equation resolutions : 98 0.17/0.49 # Propositional unsat checks : 0 0.17/0.49 # Propositional check models : 0 0.17/0.49 # Propositional check unsatisfiable : 0 0.17/0.49 # Propositional clauses : 0 0.17/0.49 # Propositional clauses after purity: 0 0.17/0.49 # Propositional unsat core size : 0 0.17/0.49 # Propositional preprocessing time : 0.000 0.17/0.49 # Propositional encoding time : 0.000 0.17/0.49 # Propositional solver time : 0.000 0.17/0.49 # Success case prop preproc time : 0.000 0.17/0.49 # Success case prop encoding time : 0.000 0.17/0.49 # Success case prop solver time : 0.000 0.17/0.49 # Current number of processed clauses : 154 0.17/0.49 # Positive orientable unit clauses : 68 0.17/0.49 # Positive unorientable unit clauses: 2 0.17/0.49 # Negative unit clauses : 24 0.17/0.49 # Non-unit-clauses : 60 0.17/0.49 # Current number of unprocessed clauses: 541 0.17/0.49 # ...number of literals in the above : 1159 0.17/0.49 # Current number of archived formulas : 0 0.17/0.49 # Current number of archived clauses : 637 0.17/0.49 # Clause-clause subsumption calls (NU) : 41194 0.17/0.49 # Rec. Clause-clause subsumption calls : 23251 0.17/0.49 # Non-unit clause-clause subsumptions : 106 0.17/0.49 # Unit Clause-clause subsumption calls : 549 0.17/0.49 # Rewrite failures with RHS unbound : 3 0.17/0.49 # BW rewrite match attempts : 268 0.17/0.49 # BW rewrite match successes : 174 0.17/0.49 # Condensation attempts : 0 0.17/0.49 # Condensation successes : 0 0.17/0.49 # Termbank termtop insertions : 81043 0.17/0.49 0.17/0.49 # ------------------------------------------------- 0.17/0.49 # User time : 0.150 s 0.17/0.49 # System time : 0.012 s 0.17/0.49 # Total time : 0.161 s 0.17/0.49 # Maximum resident set size: 2896 pages 0.17/0.49 EOF